Published in: LIPIcs, Volume 75, 16th International Symposium on Experimental Algorithms (SEA 2017)
Jacob Focke, Nicole Megow, and Julie Meißner. Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. In 16th International Symposium on Experimental Algorithms (SEA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 75, pp. 22:1-22:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{focke_et_al:LIPIcs.SEA.2017.22, author = {Focke, Jacob and Megow, Nicole and Mei{\ss}ner, Julie}, title = {{Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments}}, booktitle = {16th International Symposium on Experimental Algorithms (SEA 2017)}, pages = {22:1--22:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-036-1}, ISSN = {1868-8969}, year = {2017}, volume = {75}, editor = {Iliopoulos, Costas S. and Pissis, Solon P. and Puglisi, Simon J. and Raman, Rajeev}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2017.22}, URN = {urn:nbn:de:0030-drops-76202}, doi = {10.4230/LIPIcs.SEA.2017.22}, annote = {Keywords: MST, explorable uncertainty, competitive ratio, experimental algorithms} }
Feedback for Dagstuhl Publishing